Proof checking and logic programming

Logic Programming and Model Checking

We report on the current status of the LMC project, which seeks to deploy the latest developments in logic-programming technology to advance the state of the art of system speci cation and veri cation. In particular, the XMCmodel checker for value-passing CCS and the modal mu-calculus is discussed, as well as the XSB tabled logic programming system, on which XMC is based. Additionally, several ...

Proof Manipulations for Logic Programming Proof Systems

Logic programs consist of formulas of mathematical logic and various proof-theoretic techniques can be used to design and analyse execution models for such programs. In this paper we present some initial work on the problem of making systematic the design of logic programming languages. In particular, we identify and discuss several key properties of proofs. A important aspect of this examinati...

Integrating Model Checking and Inductive Logic Programming

Inductive Logic Programming can be used to provide automated support to help correct the errors identified by model checking, which in turn provides the relevant context for learning hypotheses that are meaningful within the domain of interest. Model checking and Inductive Logic Programming can thus be seen as two complementary approaches with much to gain from their integration. In this paper ...

Concurrency in Proof Normalization and Logic Programming

1 . In t roduct ion Proof normalization has a long history in mathematical logic [Prawitz 1965]. The significant result for computer science is as follows: // there is a proof of the formula 3z(A(z)), one can get an answer t, which satisfies A(t), after normalizing the proof. This realizes a computation, which is appropriately called logic programming. However, it is less efficient than Prolog....

Machine Checking Proof Theory: An Application of Logic to Logic